Permutation Group Subdegrees and the Common Divisor Graph
نویسندگان
چکیده
منابع مشابه
THE ZERO-DIVISOR GRAPH OF A MODULE
Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for Γ(RM). We Will show that Γ(RM) is connected withdiam Γ(RM)≤ 3 and if Γ(RM) contains a cycle, then Γ(RM)≤4. We will also show tha...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملThe Common Neighborhood Graph and Its Energy
Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.
متن کاملOn minimal subdegrees of finite primitive permutation groups
We study the minimal non-trivial subdegrees of finite primitive permutation groups that admit an embedding into a wreath product in product action, giving a connection with the same quantity for the primitive component. We discover that the primitive groups of twisted wreath type exhibit different (but interesting) behaviour from the other primitive types. 2000 Mathematics Subject Classificatio...
متن کاملon the tenacity of cycle permutation graph
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1993
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1152